Continuous-Stage Runge–Kutta Approximation to Differential Problems
نویسندگان
چکیده
In recent years, the efficient numerical solution of Hamiltonian problems has led to definition a class energy-conserving Runge-Kutta methods named Boundary Value Methods (HBVMs). Such admit an interesting interpretation in terms continuous-stage methods, which is here recalled and revisited for general differential problems.
منابع مشابه
A continuous approximation fitting to the discrete distributions using ODE
The probability density functions fitting to the discrete probability functions has always been needed, and very important. This paper is fitting the continuous curves which are probability density functions to the binomial probability functions, negative binomial geometrics, poisson and hypergeometric. The main key in these fittings is the use of the derivative concept and common differential ...
متن کاملDifferential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled by vehicles. We design constant differential approximation algorithms for some of these problems. In particular we obtain differential bounds: 1 2 for Metric 3VRP,
متن کاملAlgorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Uncertainty is a facet of many decision environments and might arise for various reasons, such as unpredictable information revealed in the future, or inherent fluctuations caused by noise. Stochastic optimization provides a means to handle uncertainty by modeling it by a probability distribution over possible realizations of the actual data, called scenarios. The field of stochastic optimizati...
متن کاملApproximation Algorithms for 2-Stage Stochastic Scheduling Problems
There has been a series of results deriving approximation algorithms for 2-stage discrete stochastic optimization problems, in which the probabilistic component of the input is given by means of "black box", from which the algorithm "learns" the distribution by drawing (a polynomial number of) independent samples. The performance guarantees proved for such problems, of course, is generally wors...
متن کاملa continuous approximation fitting to the discrete distributions using ode
the probability density functions fitting to the discrete probability functions has always been needed, and very important. this paper is fitting the continuous curves which are probability density functions to the binomial probability functions, negative binomial geometrics, poisson and hypergeometric. the main key in these fittings is the use of the derivative concept and common differential ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11050192